One - dimensional range searching . Two - dimensional range - searching
نویسندگان
چکیده
A dynamic algorithm was characterized by the concept of an “on-line” sequence of operations on a data structure. These operations being query and update. Each operation may be performed before the next operation is known. For example, if you had a directed graph, an intermixing of updates and queries to this graph can be made. A query might be: is there a directed path between two nodes of the graph? An update may be: add an edge to the graph. The performance of dynamic alogrithms is measured by the asymptotic space needed, the aymptotic time to perform a query and the asymptotic time to perform an update. Typically these performance characteristics indicate worst-case analysis. Average-case analysis being too difficult – one of the reasons for this is that it is hard to define what an average-case is. If a sequence of N operations takes time T, then the amortized time complexitiy of an operation in the sequence takes time T/N. A worst-case amortized time complexity guarantees what the average performance will be for an asymptotically large n.
منابع مشابه
New Data Structures for Orthogonal Range Searching
We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in , we achieve query time using space , where denotes the number of stored points and the number of points to be reported. For the range reporting problem on an ! " grid, we achieve query time # $ % & using space ' ( . For the two-dimensional se...
متن کاملSolving approximate similarity queries
As we know, both nearest neighbor and range searching problems are among the most important and fundamental problems in computational geometry because of its numerous important application areas [1, 2]. Specially, in many modern database applications, high-dimensional searching problems arise when complex objects are represented by vectors of d numeric features. As the dimension d increases hig...
متن کاملExtending Lévy search theory from one to higher dimensions: Lévy walking favours the blind.
A diverse range of organisms, including T cells, E. coli, honeybees, sharks, turtles, bony fish, jellyfish, wandering albatrosses and even human hunter-gatherers have movement patterns that can be approximated by Lévy walks (LW; sometimes called Lévy flights in the biological and ecological literature). These observations lend support to the 'Lévy flight foraging hypothesis' which asserts that ...
متن کاملNew Results on Intersection Query Problems
We present simple algorithms for three problems belonging to the class of intersection query problems. The "rst algorithm deals with the static rectangle enclosure problem and can easily be extended to d dimensions, the second algorithm copes with the generalized c-oriented polygon intersection searching problem in two dimensions, while the third solves the static 2-dimensional dominance search...
متن کاملLinkk Oping Electronic Articles in Batched Range Searching on a Mesh-connected Simd Computer Linkk Oping Electronic Articles in Computer and Information Science
Given a set of n points and hyperrectangles in d dimensional space the batched range searching problem is to determine which points each hyperrectangle contains We present two parallel algorithms for this problem on a p n pn mesh connected paral lel computer one average case e cient algorithm based on cell division and one worst case e cient divide and conquer algo rithm Besides the asymptotic ...
متن کاملEfficient Data Structures for Range Searching on a Grid
We consider the 2-dimensional range searching problem in the case where all points lie on an integer grid. A new data structure is presented that solves range queries on a U * U grid in O( k + log log U) time using O( n log n) storage, where n is the number of points and k the number of reported answers. Although the query time is very good the preprocessing time of this method is very high. A ...
متن کامل